Optimal Scheduling Using Branch and Bound with SPIN 4.0

The use of model checkers to solve discrete optimisation problems is appealing. A model checker can first be used to verify that the model of the problem is correct. Subsequently, the same model can be used to find an optimal solution for the problem. This paper describes how to apply the new PROMELA primitives of SPIN 4.0 to search effectively for the optimal solution. We show how Branch-and-Bound techniques can be added to the LTL property that is used to find the solution. The LTL property is dynamically changed during the verification. We also show how the syntactical reordering of statements and/or processes in the PROMELA model can improve the search even further. The techniques are illustrated using two running examples: the Travelling Salesman Problem and a job-shop scheduling problem

Bounded LTL Model Checking with Stable Models

In this paper bounded model checking of asynchronous concurrent systems is introduced as a promising application area for answer set programming. As the model of asynchronous systems a generalisation of communicating automata, 1-safe Petri nets, are used. It is shown how a 1-safe Petri net and a requirement on the behaviour of the net can be translated into a logic program such that the bounded model checking problem for the net can be solved by computing stable models of the corresponding program. The use of the stable model semantics leads to compact encodings of bounded reachability and deadlock detection tasks as well as the more general problem of bounded model checking of linear temporal logic. Correctness proofs of the devised translations are given, and some experimental results using the translation and the Smodels system are presented.Comment: 32 pages, to appear in Theory and Practice of Logic Programmin

Condensate density and superfluid mass density of a dilute Bose gas near the condensation transition

We derive, through analysis of the structure of diagrammatic perturbation theory, the scaling behavior of the condensate and superfluid mass density of a dilute Bose gas just below the condensation transition. Sufficiently below the critical temperature, $T_c$, the system is governed by the mean field (Bogoliubov) description of the particle excitations. Close to $T_c$, however, mean field breaks down and the system undergoes a second order phase transition, rather than the first order transition predicted in Bogoliubov theory. Both condensation and superfluidity occur at the same critical temperature, $T_c$ and have similar scaling functions below $T_c$, but different finite size scaling at $T_c$ to leading order in the system size. Through a simple self-consistent two loop calculation we derive the critical exponent for the condensate fraction, $2\beta\simeq 0.66$.Comment: 4 page

Security Attributes Based Digital Rights Management

Most real-life systems delegate responsibilities to different authorities. We apply this model to a digital rights management system, to achieve flexible security. In our model a hierarchy of authorities issues certificates that are linked by cryptographic means. This linkage establishes a chain of control, identity-attribute-rights, and allows flexible rights control over content. Typical security objectives, such as identification, authentication, authorization and access control can be realised. Content keys are personalised to detect illegal super distribution. We describe a working prototype, which we develop using standard techniques, such as standard certificates, XML and Java. We present experimental results to evaluate the scalability of the system. A formal analysis demonstrates that our design is able to detect a form of illegal super distribution

The transition temperature of the dilute interacting Bose gas for NN internal degrees of freedom

We calculate explicitly the variation $\delta T_c$ of the Bose-Einstein condensation temperature $T_c$ induced by weak repulsive two-body interactions to leading order in the interaction strength. As shown earlier by general arguments, $\delta T_c/T_c$ is linear in the dimensionless product $an^{1/3}$ to leading order, where $n$ is the density and $a$ the scattering length. This result is non-perturbative, and a direct perturbative calculation of the amplitude is impossible due to infrared divergences familiar from the study of the superfluid helium lambda transition. Therefore we introduce here another standard expansion scheme, generalizing the initial model which depends on one complex field to one depending on $N$ real fields, and calculating the temperature shift at leading order for large $N$. The result is explicit and finite. The reliability of the result depends on the relevance of the large $N$ expansion to the situation N=2, which can in principle be checked by systematic higher order calculations. The large $N$ result agrees remarkably well with recent numerical simulations.Comment: 10 pages, Revtex, submitted to Europhysics Letter

Transition temperature of a dilute homogeneous imperfect Bose gas

The leading-order effect of interactions on a homogeneous Bose gas is theoretically predicted to shift the critical temperature by an amount \Delta\Tc = # a_{scatt} n^{1/3} T_0 from the ideal gas result T_0, where a_{scatt} is the scattering length and n is the density. There have been several different theoretical estimates for the numerical coefficient #. We claim to settle the issue by measuring the numerical coefficient in a lattice simulation of O(2) phi^4 field theory in three dimensions---an effective theory which, as observed previously in the literature, can be systematically matched to the dilute Bose gas problem to reproduce non-universal quantities such as the critical temperature. We find # = 1.32 +- 0.02.Comment: 4 pages, submitted to Phys. Rev. Lett; minor changes due to improvement of analysis in the longer companion pape

Bose-Einstein transition temperature in a dilute repulsive gas

We discuss certain specific features of the calculation of the critical temperature of a dilute repulsive Bose gas. Interactions modify the critical temperature in two different ways. First, for gases in traps, temperature shifts are introduced by a change of the density profile, arising itself from a modification of the equation of state of the gas (reduced compressibility); these shifts can be calculated simply within mean field theory. Second, even in the absence of a trapping potential (homogeneous gas in a box), temperature shifts are introduced by the interactions; they arise from the correlations introduced in the gas, and thus lie inherently beyond mean field theory - in fact, their evaluation requires more elaborate, non-perturbative, calculations. One illustration of this non-perturbative character is provided by the solution of self-consistent equations, which relate together non-linearly the various energy shifts of the single particle levels k. These equations predict that repulsive interactions shift the critical temperature (at constant density) by an amount which is positive, and simply proportional to the scattering length a; nevertheless, the numerical coefficient is difficult to compute. Physically, the increase of the temperature can be interpreted in terms of the reduced density fluctuations introduced by the repulsive interactions, which facilitate the propagation of large exchange cycles across the sample.Comment: two minor corrections, two refs adde

Performance Evaluation of Vision-Based Algorithms for MAVs

An important focus of current research in the field of Micro Aerial Vehicles (MAVs) is to increase the safety of their operation in general unstructured environments. Especially indoors, where GPS cannot be used for localization, reliable algorithms for localization and mapping of the environment are necessary in order to keep an MAV airborne safely. In this paper, we compare vision-based real-time capable methods for localization and mapping and point out their strengths and weaknesses. Additionally, we describe algorithms for state estimation, control and navigation, which use the localization and mapping results of our vision-based algorithms as input.Comment: Presented at OAGM Workshop, 2015 (arXiv:1505.01065

IoTSan: Fortifying the Safety of IoT Systems

Today's IoT systems include event-driven smart applications (apps) that interact with sensors and actuators. A problem specific to IoT systems is that buggy apps, unforeseen bad app interactions, or device/communication failures, can cause unsafe and dangerous physical states. Detecting flaws that lead to such states, requires a holistic view of installed apps, component devices, their configurations, and more importantly, how they interact. In this paper, we design IoTSan, a novel practical system that uses model checking as a building block to reveal "interaction-level" flaws by identifying events that can lead the system to unsafe states. In building IoTSan, we design novel techniques tailored to IoT systems, to alleviate the state explosion associated with model checking. IoTSan also automatically translates IoT apps into a format amenable to model checking. Finally, to understand the root cause of a detected vulnerability, we design an attribution mechanism to identify problematic and potentially malicious apps. We evaluate IoTSan on the Samsung SmartThings platform. From 76 manually configured systems, IoTSan detects 147 vulnerabilities. We also evaluate IoTSan with malicious SmartThings apps from a previous effort. IoTSan detects the potential safety violations and also effectively attributes these apps as malicious.Comment: Proc. of the 14th ACM CoNEXT, 201

Verifying RoboCup Teams

Pocreeding of: 5th International Workshop on Model Checking and Artificial Intelligence. MOCHART-2008, Patras, Greece, july, 21st, 2008.Verification of multi-agent systems is a challenging task due to their dynamic nature, and the complex interactions between agents. An example of such a system is the RoboCup Soccer Simulator, where two teams of eleven independent agents play a game of football against each other. In the present article we attempt to verify a number of properties of RoboCup football teams, using a methodology involving testing. To accomplish such testing in an efficient manner we use the McErlang model checker, as it affords precise control of the scheduling of the agents, and provides convenient access to the internal states and actions of the agents of the football teams.This work has been partially supported by the FP7-ICT-2007-1 project ProTest (215868), a Ramón y Cajal grant from the Spanish Ministerio de Educación y Ciencia, and the Spanish national projects TRA2007-67374-C02-02, TIN2006-15660-C02- 02 (DESAFIOS) and S-0505/TIC/0407 (PROMESAS).Publicad